package com.cat.DataStructure04;

/**
 * @author 曲大人的喵
 * @description https://leetcode.cn/problems/number-of-unique-xor-triplets-i/
 * @create 2025/11/29 11:02
 * @since JDK17
 */

public class Solution23 {
    public int uniqueXorTriplets(int[] nums) {
        int n = nums.length;
        for (int i = 20; i >= 0; i--) {
            if (((1 << i) & n) != 0) {
                return 1 << i + 1;
            }
        }
        return 0;
    }
}
